Shelling Processes and a New Characterization of Convex Geometries
نویسندگان
چکیده
We provide a new characterization of convex geometries via a multi-variate version of an identity that was originally proved by Maneva, Mossel and Wainwright for particular combinatorial objects defined in the context of the k-SAT problem. We thus highlight the connection between various characterizations of convex geometries and a family of removal processes studied in the literature on random structures.
منابع مشابه
Local topology of the free complex of a two-dimensional generalized convex shelling
A generalized convex shelling was introduced by Kashiwabara, Nakamura & Okamoto for their representation theorem of convex geometries. Motivated by the work by Edelman & Reiner, we study local topology of the free complex of a two-dimensional separable generalized convex shelling. As a result, we prove a deletion of an element from such a complex is homotopy equivalent to a single point or two ...
متن کاملSeveral Aspects of Antimatroids and Convex Geometries Master's Thesis
Convexity is important in several elds, and we have some theories on it. In this thesis, we discuss a kind of combinatorial convexity, in particular, antimatroids and convex geometries. An antimatroid is a combinatorial abstraction of convexity. It has some di erent origins; by Dilworth in lattice theory, by Edelman and Jamison in the notions of convexity, by Korte{Lov asz who were motivated by...
متن کاملPruning processes and a new characterization of convex geometries
We provide a new characterization of convex geometries via a multivariate version of an identity that was originally proved, in a special case arising from the k-SAT problem, by Maneva, Mossel and Wainwright. We thus highlight the connection between various characterizations of convex geometries and a family of removal processes studied in the literature on random structures.
متن کاملThe free complex of a two-dimensional generalized convex shelling
In this article, we study two open problems posed by Edelman & Reiner about topology of certain simplicial complexes associated with abstract convex geometries. As a special case, we concentrate on generalized convex shellings, which were introduced by Kashiwabara, Nakamura & Okamoto for their representation theorem of abstract convex geometries. We answer one of the problems affirmatively for ...
متن کاملCharacterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints
This paper studies the convex multiobjective optimization problem with vanishing constraints. We introduce a new constraint qualification for these problems, and then a necessary optimality condition for properly efficient solutions is presented. Finally by imposing some assumptions, we show that our necessary condition is also sufficient for proper efficiency. Our results are formula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0706.3750 شماره
صفحات -
تاریخ انتشار 2007